Practical Polygonal Mesh Modeling with Discrete Gaussian-Bonnet Theorem
نویسندگان
چکیده
In this paper, we introduce a practical modeling approach to improve the quality of polygonal mesh structures. Our approach is based on a discrete version of Gaussian-Bonnet theorem on piecewise planar manifold meshes and vertex angle deflections that determines local geometric behavior. Based on discrete GaussianBonnet theorem, summation of angle deflections of all vertices is independent of mesh structure and it depends on only the topology of the mesh surface. Based on this result, it can be possible to improve organization of mesh structure of a shape according to its intended geometric structure.
منابع مشابه
A Primal-to-Primal Discretization of Exterior Calculus on Polygonal Meshes
Discrete exterior calculus (DEC) offers a coordinate-free discretization of exterior calculus especially suited for computations on curved spaces. We present an extended version of DEC on surface meshes formed by general polygons that bypasses the construction of any dual mesh and the need for combinatorial subdivisions. At its core, our approach introduces a polygonal wedge product that is com...
متن کاملA Uni ed Approach for Hierarchical Adaptive Tesselation of Surfaces
The polygonization, or tesselation, of surfaces is a classical problem that has many practical applications in computer graphics and geometric modeling. The problem consists in computing a piecewise linear approximation for a smooth surface described either by parametric or implicit functions. A polygonal mesh is the one of the simplest forms of surface description and therefore is the represen...
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملVariational Design with Parametric Meshes of Arbitrary Topology
Many mathematical problems in geometric modeling are merely due to the di culties of handling piecewise polynomial parameterizations of surfaces (e.g., smooth connection of patches, evaluation of geometric fairness measures). Dealing with polygonal meshes is mathematically much easier although in nitesimal smoothness can no longer be achieved. However, transferring the notion of fairness to the...
متن کامل